Higher-Order Intentionality and Higher-Order Acquaintance
نویسندگان
چکیده
منابع مشابه
Higher order intentionality tasks are cognitively more demanding
A central assumption that underpins much of the discussion of the role played by social cognition in brain evolution is that social cognition is unusually cognitively demanding. This assumption has never been tested. Here, we use a task in which participants read stories and then answered questions about the stories in a behavioural experiment (39 participants) and an fMRI experiment (17 partic...
متن کاملHigher-Order Order-Sorted Resolution
The introduction of sorts to rst-order automated deduction has brought greater conciseness of representation and a considerable gain in eeciency by reducing the search space. It is therefore promising to treat sorts in higher order theorem proving as well. In this paper we present a generalization of Huet's Constrained Resolution to an order-sorted type theory T with term declarations. This sys...
متن کاملHigher-Order Aspects in Order
In aspect-oriented programming languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if pointcuts in AspectJ, or simply all pointcuts in higher-order aspect languages like AspectScheme. While viewing pointcuts and advice as base level computation clearly distinguishes AOP from reflection, it also comes at ...
متن کاملHigher Order Functions Considered Unnecessary for Higher Order Programming
It is often claimed that the essence of functional programming is the use of functions as values, i.e., of higher order functions, and many interesting examples have been given showing the power of this approach. Unfortunately, the logic of higher order functions is diicult, and in particular, higher order uniication is undecidable. Moreover (and closely related), higher order expressions are n...
متن کاملVerifying Higher-Order Imperative Programs with Higher-Order Separation Logic
In this thesis I show is that it is possible to give modular correctness proofs of interesting higher-order imperative programs using higher-order separation logic. To do this, I develop a model higher-order imperative programming language, and develop a program logic for it. I demonstrate the power of my program logic by verifying a series of examples, culminating in the correctness proof of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Studies
سال: 2006
ISSN: 0031-8116,1573-0883
DOI: 10.1007/s11098-005-0241-0